A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

SDN中基于KMOBPSO的高可靠性控制器部署算法

针对SDN中控制器系统的单节点故障问题,兼顾系统成本和系统时延,应用N+1冗余备份模型来提高SDN控制器部署的可靠性,并将其抽象为多目标优化问题.同时,提出了一种融合K-means聚类算法和遗传算子的多目标二进制粒子群算法——KMOBPSO算法,以求解SDN控制器高可靠性部署问题的解.仿真结果表明,所提算法具有求解精度高、分布均匀、沿Pareto前沿面覆盖广的特点,能够显著提高SDN中控制器部署的可靠性.     

Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.     

浅谈如何有效学习计算机软件知识

计算机软件知识的学习并不是完全线性的，而是不断循环往复、迭代的过程。本对如何深入、广泛、有效地学习计算机软件知识做出了一些探讨。     

一个用户接口管理系统

本文介绍了一个用户接口管理系统NUUIMS的设计和实现.重点叙述了该系统基于规范化目标用户接口模型的设计思想,系统组成及描述方法.文章也讨论了使用NUUIMS设计而成的用户接口的特点.     

安徽省水资源宏观经济优化模型研究

以水资源可持续发展为出发点,探讨了一种可以同时兼顾经济发展、水资源利用和社会效益的多目标水资源宏观经济模型的建立方法,通过引入带权2-模评价函数,将多目标优化问题转变成单目标优化问题。以2002年为现状水平年,对安徽省2010年的产业结构及产业规模进行优化分析。结果表明,多目标模型求得的总用水量较单目标模型明显降低,而两模型优化的产业规模与结构差别不大,体现了高用水效率行业优先发展的要求。     

C语言学习方法与实践的探讨

针对C语言程序设计课程本身的特点，分析学习过程中存在的问题，强调实践的必要性。结合一些学校课程改革和实践的经验．提出面向应用的，科学的学习内容、方法和模式。同时提高学习者的专业动手能力。     

多目标模糊全局优化设计方法和软件

分析了优化设计在土木工程中应用不够广泛的原因，由此提出了一个能用于工程设计的多目标模糊全局优化设计方法。介绍了按该方法研制的软件ＭＦＤ的功能和性能，以及一个用该软件分析的拱坝体型设计实例。     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002